منابع مشابه
General definitions for the union and intersection of ordered fuzzy multisets
Since its original formulation, the theory of fuzzy sets has spawned a number of extensions where the role of membership values in the real unit interval $[0, 1]$ is handed over to more complex mathematical entities. Amongst the many existing extensions, two similar ones, the fuzzy multisets and the hesitant fuzzy sets, rely on collections of several distinct values to represent fuzzy membershi...
متن کاملIntersection Theorems for Vector Spaces
[ n] qni_ 1 = IT / i . t q O""i<, q -1 Since we always refer to the same K, we will write this simply as [7]. If A, Bare subspaces of V, A < B, then B/ A denotes the factor space of B by A. If An B = (O)-the zero-space, then AB / A is the canonical projection of B into V / A. Suppose 1 ~ k < nand !¥ = {Fl> .. . , Fm} is a family of distinct k-dimensional subspaces of V. For 0 ~ s ~ k, let !¥(s)...
متن کاملIntersection homology Künneth theorems
Cohen, Goresky and Ji showed that there is a Künneth theorem relating the intersection homology groups I H∗(X × Y ) to I H∗(X) and I H∗(Y ), provided that the perversity p̄ satisfies rather strict conditions. We consider biperversities and prove that there is a Künneth theorem relating I H∗(X × Y ) to I H∗(X) and I H∗(Y ) for all choices of p̄ and q̄. Furthermore, we prove that the Künneth theorem...
متن کاملMore complete intersection theorems
The seminal complete intersection theorem of Ahlswede and Khachatrian gives the maximum cardinality of a k-uniform t-intersecting family on n points, and describes all optimal families. In recent work, we extended this theorem to the weighted setting, giving the maximum μp measure of a t-intersecting family on n points. In this work, we prove two new complete intersection theorems. The first gi...
متن کاملIntersection Theorems for Systems of Sets (iii)
A system or family (A. : y E N) of sets A y , indexed by the elements of a set N, is called an (a, b)-system if I N I = a and I A,, I = b for y c-N. Expressions such as "(a, < b)-system" are self-explanatory. The system (A,, : y c N) is called a A-system [1] if A,, n A,, = Ap n A Q whenever p, y, p, c c N ; p 7~ y ; p =A a. If we want to indicate the cardinality I NJ of the index set N then we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2016
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2015.09.006